A New Starting Potential Fair Queuing Algorithm with O(1) Virtual Time Computation Complexity
نویسندگان
چکیده
Dong-Yong Kwak et al. 475 In this paper, we propose an efficient and simple fair queuing algorithm, called new starting potential fair queuing (NSPFQ), which has O(1) complexity for virtual time computation and also has good delay and fairness properties. NSPFQ introduces a simpler virtual time recalibration method as it follows a rate-proportional property. The NSPFQ algorithm recalibrates the system virtual time to the minimum virtual start time among all possible virtual start times for head-of-line packets in backlogged sessions. Through analysis and simulation, we show that the proposed algorithm has good delay and fairness properties. We also propose a hardware implementation framework for the scheduling algorithm.
منابع مشابه
Probabilistic Fair Queuing
Packet scheduling constitutes the core problem in efficient fair allocation of bandwidth to competing flows. To date, numerous algorithms for packet scheduling have been suggested and tested. However, only a few of them are currently deployed. One of the key reasons for rarity of applied packet scheduling methods lies in the complexity of their implementation. This paper describes a family of r...
متن کاملA practical fair queuing scheduler: Simplification through quantization
The design of fair packet schedulers involves a tradeoff between implementation complexity, on one hand, and delay and fairness guarantees, on the other. In this paper, we present tiered-service fair queuing (TSFQ), a new scheduler that exploits certain properties of Internet traffic to speed up the bottleneck operations related to virtual time computation and packet sorting. Specifically, TSFQ...
متن کاملPractical Fair Queuing Schedulers : Simplification through Quantization . ( Under the direction
Dwekat, Zyad A. Practical Fair Queuing Schedulers: Simplification through Quantization. (Under the direction of Dr. George Rouskas and Dr. Mladen Vouk). Many packet scheduling schemes have been proposed, but most of them suffer from one of two extremes. A scheduling scheme may have simple implementation with low fairness qualities, or it may have good fairness qualities but high complexity. Our...
متن کاملPractical Fair Queuing Schedulers: Simplification through Quantization Table of Contents
DWEKAT, ZYAD A. Practical Fair Queuing Schedulers: Simplification through Quantization. (Under the direction of Dr. George Rouskas and Dr. Mladen Vouk). Many packet scheduling schemes have been proposed, but most of them suffer from one of two extremes. A scheduling scheme may have simple implementation with low fairness qualities, or it may have good fairness qualities but high complexity. Our...
متن کاملLeap Forward Virtual Clock: An O(loglogN) Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness
We describe an e cient fair queuing scheme, Leap Forward Virtual Clock , that provides endto-end delay bounds almost identical to that of PGPS fair queuing, along with throughput fairness. Our scheme can be implemented with a worst-case time O(log logN ) per packet (inclusive of sorting costs), which improves upon all previously known schemes that achieve guaranteed delay and throughput fairnes...
متن کامل